Avoiding Monochromatic Sequences With Special Gaps
نویسندگان
چکیده
منابع مشابه
Avoiding Monochromatic Sequences With Special Gaps
For S ⊆ Z+ and k and r fixed positive integers, denote by f(S, k; r) the least positive integer n (if it exists) such that within every r-coloring of {1, 2, . . . , n} there must be a monochromatic sequence {x1, x2, . . . , xk} with xi − xi−1 ∈ S for 2 ≤ i ≤ k. We consider the existence of f(S, k; r) for various choices of S, as well as upper and lower bounds on this function. In particular, we...
متن کاملFinding Patterns Avoiding Many Monochromatic Constellations
Given fixed 0 = q0 < q1 < q2 < · · · < qk = 1 a constellation in [n] is a scaled translated realization of the qi with all elements in [n], i.e., p, p + q1d, p + q2d, . . . , p + qk−1d, p + d. We consider the problem of minimizing the number of monochromatic constellations in a two coloring of [n]. We show how given a coloring based on a block pattern how to find the number of monochromatic sol...
متن کاملEdge-colorings avoiding rainbow and monochromatic subgraphs
For two graphs G and H , let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph with n vertices having no monochromatic subgraph isomorphic to G and no totally multicolored (rainbow) subgraph isomorphic to H . These two numbers generalize the classical anti-Ramsey and Ramsey numbers, respectively. ...
متن کاملChromatic Sums for Colorings Avoiding Monochromatic Subgraphs
Given graphs G and H, a vertex coloring c : V (G) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ(H,G), is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G, Σ(H,G), is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for ...
متن کاملPlanar graph coloring avoiding monochromatic subgraphs: trees
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2007
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480103422196